Storage-Free Memory Dependency Prediction

Storage in Deterministic Dependency Parsing

Memory-Based Dependency Parsing

This paper reports the results of experiments using memory-based learning to guide a deterministic dependency parser for unrestricted natural language text. Using data from a small treebank of Swedish, memory-based classifiers for predicting the next action of the parser are constructed. The accuracy of a classifier as such is evaluated on held-out data derived from the treebank, and its perfor...

Modeling Dependency in Prediction Markets

In the last decade, prediction markets became popular forecasting tools in areas ranging from election results to movie revenues and Oscar nominations. One of the features that make prediction markets particularly attractive for decision support applications is that they can be used to answer “what if” questions and estimate probabilities of complex events. Traditional approach to answering suc...

Dependency-Free Parallel Progressive Meshes

The constantly increasing complexity of polygonal models in interactive applications poses two major problems. First, the number of primitives that can be rendered at real-time frame rates is currently limited to a few million. Second, less than 45 million triangles – with vertices and normal – can be stored per gigabyte. While the rendering time can be reduced using level-of-detail (LOD) algor...

Interaction-Free Multivalued Dependency Sets

Multivalued dependencies (MVD) and join dependencies were introduced to study database design problems. Join dependencies can be divided into cyclic and acyclic join dependencies. A fundamental result in dependency theory is that a join Dependency is acyclic if and only if it is equivalent to a set of MVDs. In addition to this characterization it has been shown that such a set of MVDs has a cov...